Quasirecognition by prime graph of finite simple groups L n (2) and U n (2)

Let G be a finite group. The prime graph ??(G) of G is defined as follows. The vertices of ??(G) are the primes dividing the order of G and two distinct vertices p, p?? are joined by an edge if G has an element of order pp??. Let L=L _n (2) or U _n (2), where n?R17. We prove that L is quasirecognizable by prime graph, i.e. if G is a finite group such that ??(G)=??(L), then G has a unique nonabelian composition factor isomorphic to L. As a consequence of our result we give a new proof for the recognition by element orders of L _n (2). Also we conclude that the simple group U _n (2) is quasirecognizable by element orders.     

Optimization scheme for sensor coverage scheduling with bandwidth constraints

Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a “trade-off” scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in (Cheng et al. in INFOCOM’ 05, 2005).     

EXISTENCE AND UNIQUENESS OF SOLUTIONS TO A BACKWARD STOCHASTIC DIFFERENTIAL EQUATION

A backward stochastic diferential equation is discussed in this paper. Under some weaker conditions than uniformly Lipschitzian condition given by Pardoux and Peng(1990), using Picard interaction and Cauchy sequence, the existence and uniqueness of the solutions to the backward stochastic diferential equation.     

The Sigmoidal Transfer Function and the Gain-Threshold Exponential Dependence for Neurons from Statistical Mechanics Treatment

Analogy is used to treat the system of non-interacting integrate-and-fire neurons as an ideal Fermi gas. It allows to obtain the nonlinear gain curve in the form of sigmoid in agreement with biological findings. As the by-product the gain-threshold mechanism in neurons is presented. Surprisingly enough, this is in agreement with new biological findings, too. Besides, the application of this mechanism to the dynamics of neurons leads to the non-monotone transfer function.     

The complexity of a class of infinite graphs

IfG _k is the family of countable graphs with nok vertex (or edge) disjoint circuits (1<k<) then there is a countableG _k G _k such that every member ofG _k is an (induced) subgraph of some member ofG _k , but no finiteG _k suffices.     

Wannier-Stark effect on surface states

A recursive Green-function (RGF) technique is used to study the surface states of an electrified solid. The concatenating nature of the method leads to a continued-fraction form of the RGF, which can be expressed as a ratio of Bessel functions. The surface density of states (SDOS), derived from the RGF, reveals a quasi-Stark-ladder distribution of the energy levels at the surface atom. The dependence of the SDOS on the applied field and surface perturbation parameters is discussed.     

7个经典Ramsey数R(k,l)的新下界

利用构造性的方法,得到7个经典Ramsey数的新下界R(3,29)≥174,R(4,23)≥272,R(5,24)≥488,R(7,12)≥312,R(8,18)≥728,R(8,20)≥860,R(9,21)≥1278.     

Towards enantiomeric 2,3-epoxypropylphosphonates

Hydrolysis of diethyl 2,3-epoxypropylphosphonate in the presence of (R,R)-salen–Co(III)-OAc after 19 h afforded a mixture of (S)-epoxide (82% ee) and diethyl (R)-2,3-dihydroxypropylphosphonate (98% ee). Improved enantiomeric excess (93%) of the (S)-epoxide was obtained in the 72 h hydrolytic kinetic resolution experiment. Acid-catalyzed hydrolysis of (S)-epoxide (91% ee) gave (S)-diol (72% ee) due to low C-3 regioselectivity of the reaction.